modus ponens造句

• Condition 2 says that provably true formulas are closed under modus ponens.
• Both rules are based on the modus ponens inference rule.
• (1 ) is a typical example of modus ponens.
• Modus ponens would apply if you knew she put on her shoes.
• :: : : This is a formally valid modus ponens argument.
• Constructive dilemma is the disjunctive version of modus ponens.
• This is the " modus ponens " rule of propositional logic.
• We can then detach the conclusion, ?, via the modus ponens rule.
• The disjunctive version of " modus ponens " is the constructive dilemma.
• In artificial intelligence, " modus ponens " is often called forward chaining.
• These inference engines support forward reasoning or backward reasoning to infer conclusions via modus ponens.
• It isn't modus ponens.
• From these, we can obtain B by an application of the standard deduction rule modus ponens.
• :Well, I changed my approach and did a second transitivity instead of a modus ponens.
• Modus ponens is closely related to another valid form of argument, " modus tollens ".
• Hypothetical syllogism is closely related to modus ponens and sometimes thought of as " double modus ponens ."
• Hypothetical syllogism is closely related to modus ponens and sometimes thought of as " double modus ponens ."
• X and " modus ponens " implies X and subsequently Y ( as in above proof ).
• This rule is equivalent to the rule of inference known as modus ponens, except it is going backwards.
• Applying modus ponens, we get that " A " is a theorem of the extended system.